Space proof complexity for random 3-CNFs
نویسندگان
چکیده
منابع مشابه
Space proof complexity for random 3-CNFs
We investigate the space complexity of refuting 3-CNFs in Resolution and algebraic systems. We prove that every Polynomial Calculus with Resolution refutation of a random 3-CNF φ in n variables requires, with high probability, Ω(n) distinct monomials to be kept simultaneously in memory. The same construction also proves that every Resolution refutation φ requires, with high probability, Ω(n) cl...
متن کاملSpace proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem
We investigate the space complexity of refuting 3-CNFs in Resolution and algebraic systems. No lower bound for refuting any family of 3-CNFs was previously known for the total space in resolution or for the monomial space in algebraic systems. Using the framework of [10], we prove that every Polynomial Calculus with Resolution refutation of a random 3-CNF φ in n variables requires, with high pr...
متن کاملA Framework for Proving Proof Complexity Lower Bounds on Random CNFs Using Encoding Techniques
Propositional proof complexity is an area of complexity theory that addresses the question of whether the class NP is closed under complement, and also provides a theoretical framework for studying practical applications such as SAT solving. Some of the most well-studied contradictions are random k-CNF formulas where each clause of the formula is chosen uniformly at random from all possible cla...
متن کاملSpace in Proof Complexity
Propositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter. There are different approaches to reasoning that are captured by corresponding proof systems, each with its own strengths and weaknesses and need for resources. The simplest an...
متن کاملRandom CNFs are Hard for Cutting Planes
The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satisfiablity algorithms, and lastly average-case hardness over this distribution has also been linked to hardness of approximation via Feige’s hypothesis. In this paper, we prove that any Cutting Planes refutation for ran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2017.06.003